Some Aspects of Hankel Matrices in Coding Theory and Combinatorics
نویسنده
چکیده
Hankel matrices consisting of Catalan numbers have been analyzed by various authors. DesainteCatherine and Viennot found their determinant to be ∏ 1≤i≤j≤k i+j+2n i+j and related them to the Bender Knuth conjecture. The similar determinant formula ∏ 1≤i≤j≤k i+j−1+2n i+j−1 can be shown to hold for Hankel matrices whose entries are successive middle binomial coefficients (2m+1 m ) . Generalizing the Catalan numbers in a different direction, it can be shown that determinants of Hankel matrices consisting of numbers 1 3m+1 ( 3m+1 m ) yield an alternate expression of two Mills – Robbins – Rumsey determinants important in the enumeration of plane partitions and alternating sign matrices. Hankel matrices with determinant 1 were studied by Aigner in the definition of Catalan – like numbers. The well known relation of Hankel matrices to orthogonal polynomials further yields a combinatorial application of the famous Berlekamp – Massey algorithm in Coding Theory, which can be applied in order to calculate the coefficients in the three – term recurrence of the family of orthogonal polynomials related to the sequence of Hankel matrices.
منابع مشابه
On Fischer{frobenius Transformations and the Structure of Rectangular Block Hankel Matrices
In this paper, we develop three essential ingredients of an algebraic structure theory of nite block Hankel matrices. The development centers around a transformation of block Hankel matrices, rst introduced by Fischer and Frobenius for scalar Hankel matrices. We prove three results: First, Iohvidov's fundamental notion of the characteristic of a Hankel matrix is extended to the block matrix cas...
متن کاملGeneralized partial realizations
In this paper we extend Kalman's concept of partial realization and deene generalized partial realizations of nite matrix sequences by descriptor systems. Our deenition is in agreement with the realization theory for deterministic boundary value descriptor systems 15]. The aim of this contribution is to prove a counterpart of Kalman's main theorem of realization theory for generalized partial r...
متن کاملOn the computation of the nullspace of Toeplitz–like matrices
The knowledge of the nullspace and its size of some structured matrices, like Hankel and Toeplitz matrices, is important in many applications arising in system theory. In this paper we describe an algorithm to compute the kernel of Toeplitz and Hankel matrices based on the generalized Schur algorithm.
متن کاملWave propagation theory in offshore applications
A frequency-wavenumber-domain formulation is presented in this paper for calculation of the Green's functions and wave propagation modes in a stratified fluid body underlain by a layered viscoelastic soil medium. The Green's functions define the solid and fluid displacements and fluid pressures due to uniform disk loads acting in either the soil or fluid media. The solution is in the frequency ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 8 شماره
صفحات -
تاریخ انتشار 2001